Integers with a maximal number of Fibonacci representations
نویسندگان
چکیده
منابع مشابه
Integers with a maximal number of Fibonacci representations
We study the properties of the function R(n) which determines the number of representations of an integer n as a sum of distinct Fibonacci numbers Fk. We determine the maximum and mean values of R(n) for Fk ≤ n < Fk+1. Mathematics Subject Classification. 11A67, 11B39.
متن کاملOn representations of positive integers in the Fibonacci base
We exhibit and study various regularity properties of the sequence (R(n))n 1 which counts the number of different representations of the positive integer n in the Fibonacci numeration system. The regularity properties in question are observed by representing the sequence as a two-dimensional array consisting of an infinite number of rows L1, L2, L3, . . . where each Lk contains fk−1 (the k − 1s...
متن کاملFibonacci Integers
A Fibonacci integer is an integer in the multiplicative group generated by the Fibonacci numbers. For example, 77 = 21 · 55/(3 · 5) is a Fibonacci integer. Using some results about the structure of this multiplicative group, we determine a near-asymptotic formula for the counting function of the Fibonacci integers, showing that up to x the number of them is between exp(c(log x) − (log x)) and e...
متن کاملBounds on the Fibonacci Number of a Maximal Outerplanar Graph
All graphs in this article are finite, undirected, without loops or multiple edges. Let G be a graph with vertices vl5 v2,..., vn. The complement in G of a subgraph H is the subgraph of G obtained by deleting all edges in H. The join GxvG2 of two graphs GY and G2 is obtained by adding an edge from each vertex in Gl to each vertex in G2. Let Kn be the complete graph and Pn the path on n vertices...
متن کاملThe number of maximal sum-free subsets of integers
Cameron and Erdős [6] raised the question of how many maximal sum-free sets there are in {1, . . . , n}, giving a lower bound of 2bn/4c. In this paper we prove that there are in fact at most 2(1/4+o(1))n maximal sum-free sets in {1, . . . , n}. Our proof makes use of container and removal lemmas of Green [8, 9] as well as a result of Deshouillers, Freiman, Sós and Temkin [7] on the structure of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2005
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita:2005022